Recognizing even-cycle and even-cut matroids
نویسندگان
چکیده
Even-cycle matroids are elementary lifts of graphic and even-cut cographic matroids. We present a polynomial algorithm to check if binary matroid is an even-cycle we matroid. These two algorithms rely on (to be described in pair follow-up papers) pinch-graphic.
منابع مشابه
Stabilizer theorems for even cut matroids
A graft is a representation of an even cut matroid M if the cycles of M correspond to the even cuts of the graft. Two, long standing, open questions regarding even cut matroids are the problem of finding an excluded minor characterization and the problem of efficiently recognizing this class of matroids. Progress on these problems has been hampered by the fact that even cut matroids can have an...
متن کاملStabilizer theorems for even cycle matroids
A signed graph is a representation of an even cycle matroid M if the cycles of M correspond to the even cycles of that signed graph. Two, long standing, open questions regarding even cycle matroids are the problem finding an excluded minor characterization and the problem of efficiently recognizing this class of matroids. Progress on these problems has been hampered by the fact that even cycle ...
متن کاملBasis graphs of even Delta-matroids
A -matroid is a collection B of subsets of a finite set I, called bases, not necessarily equicardinal, satisfying the symmetric exchange property: For A,B ∈ B and i ∈ A B, there exists j ∈ B A such that (A {i, j}) ∈ B. A -matroid whose bases all have the same cardinality modulo 2 is called an even -matroid. The basis graph G=G(B) of an even -matroid B is the graph whose vertices are the bases o...
متن کاملThe even and odd cut polytopes
Deza, M. and M. Laurent, The even and odd cut polytopes, Discrete Mathematics 119 (1993) 49966. The cut polytope P, is the convex hull of the incidence vectors of all cuts of the complete graph K, on n nodes. An even cut is a cut of even cardinality. For n odd, all cuts are even. For n even, we consider the even cut polytope EvP,, defined as the convex hull of the incidence vectors of all even ...
متن کاملStrongly even cycle decomposable graphs
We introduce the notion of an Eulerian graph being strongly evencycle decomposable, and note that a few basic classes have this property. Our main results are that several fundamental composition operations that preserve the property of being Eulerian also preserve the property of being strongly even-cycle decomposable. As an application, our composition operations easily imply that all Euleria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2023
ISSN: ['0025-5610', '1436-4646']
DOI: https://doi.org/10.1007/s10107-023-01944-6